A Block Corner-Occupying Heuristic Algorithm for Constrained Two-Dimensional Guillotine Cutting Problem of Rectangular Items

Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

A population heuristic for constrained two-dimensional non-guillotine cutting

A Hybrid Heuristic for the Constrained Two-dimensional Non-guillotine Orthogonal Cutting Problem

This paper addresses a constrained two-dimensional (2D) non-guillotine cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization....

Comparison of Meta-heuristic Hybrid Approaches for Two Dimensional Non-guillotine Rectangular Cutting Problems

In this paper, six different approaches using genetic algorithms (GA) and/or simulated annealing (SA) with improved bottom left (I-BL) algorithm [1] were applied for solution of two dimensional non-guillotine cutting problems. As examples, test problems including 29 individual rectangular pieces were used [2]. Performances of hybrid approaches on solutions of cutting problems were compared. Due...

A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

In this paper we present a heuristic method to generate constrained two-dimensional guillotine cutting patterns. This problem appears in different industrial processes of cutting rectangular plates to produce ordered items, such as in the glass, furniture and circuit board business. The method combines a state space relaxation of a dynamic programming formulation of the problem, an and/or-graph...